A Siphon-Based Deadlock Prevention Strategy for S3PR
نویسندگان
چکیده
منابع مشابه
A Critical-Siphon Approach to Fastest Deadlock Controller for S3PR
The authors developed a theory to show that exactly one monitor is required for the set of siphons in the family of 2-compound siphons and how to assign its initial markings. This avoids redundant monitors and the unnecessary associated computational burden. Neither reachability graph nor minimal siphon needs to be computed to achieve polynomial complexity—essential for large systems. This chap...
متن کاملA Siphon-based Deadlock Prevention Policy for a Class of Petri Nets - SPMR
This paper focuses on the problem of deadlocks in automated flexible manufacturing systems (FMS) where deadlocks are caused by unmarked siphons in their Petri net models. A deadlock prevention policy is proposed for a subclass of Petri nets, SPMR that can well model a large class of FMS. We distinguish siphons in such a net model by elementary and dependent ones. For each elementary siphon, a m...
متن کاملDeadlock-Free Scheduling Method Using Genetic Algorithm and Timed S3PR Nets
In this paper, a new kind of deadlock-free scheduling method based on genetic algorithm and reachability analysis of timed SPR nets is proposed to solve the scheduling problems of job shop without buffers. Under the framework of timed Petri nets model, the scheduling problem can be described as finding a feasible transition firing sequence in the Petri nets model to avoid deadlock situations an...
متن کاملDeadlock Prevention for Sequence Resource Allocation Systems
This paper presents a deadlock prevention algorithm for the class of sequential resource allocation system for flexible manufacturing systems, which allows for multiple resources flexible routings. Two classes of Petri nets Extended from Systems of Simple Sequential Processes with Resources (ESPR) and Systems of Simple Sequential Processes with General Resource Requirements (SPGR) whose deadloc...
متن کاملAn Automatic Technique for Static Deadlock Prevention
Deadlocks remain one of the biggest threats to concurrent programming. Usually, the best programmers can expect is dynamic deadlock detection, which is only a palliative. Object-oriented programs, with their rich reference structure and the resulting presence of aliasing, raise additional problems. The technique developed in this paper relies on the “alias calculus” to offer a completely static...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2019
ISSN: 2169-3536
DOI: 10.1109/access.2019.2920677